A Simple Greedy Algorithm for Dynamic Graph Orientation
نویسندگان
چکیده
منابع مشابه
A Simple Greedy Algorithm for Dynamic Graph Orientation
Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure. With an immensely simple greedy algorithm, we get parametrized trade-off bounds between outdegree and...
متن کاملA GPU Algorithm for Greedy Graph Matching
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we introduce a fine-grained shared-memory parallel algorithm for maximal greedy matching, together with an implementation on the GPU, which is faster (spe...
متن کاملA simple greedy algorithm for reconstructing pedigrees.
This paper introduces a simple greedy algorithm for searching for high likelihood pedigrees using micro-satellite (STR) genotype information on a complete sample of related individuals. The core idea behind the algorithm is not new, but it is believed that putting it into a greedy search setting, and specifically the application to pedigree learning, is novel. The algorithm does not require age...
متن کاملA simple dynamic graph algorithm for recognizing proper interval graphs
We present a dynamic graph algorithm to recognize proper interval graphs that runs in O(log n) worst case time per edge update, where n is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in O(log n) time. The algorithm is simpler than the algorithm in [HSS01] and it matches its running time for edge updates and connect...
متن کاملSimple greedy 2-approximation algorithm for the maximum genus of a graph
The maximum genus γM (G) of a graph G is the largest genus of an orientable surface into which G has a cellular embedding. Combinatorially, it coincides with the maximum number of disjoint pairs of adjacent edges of G whose removal results in a connected spanning subgraph of G. In this paper we prove that removing pairs of adjacent edges from G arbitrarily while retaining connectedness leads to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0528-0